On solving Mincut Balanced Circuit Partitioning Problem for Digital Circuit Layout using Evolutionary Approach with Solution Archive
نویسندگان
چکیده
منابع مشابه
On solving Mincut Balanced Circuit Partitioning Problem for Digital Circuit Layout using Evolutionary Approach with Solution Archive
The interest in finding an optimal partition in the area of VLSI has been a hot issue in recent years. Circuit Partitioning Problem is one of the most studied NP complete problems notable for its broad spectrum of applicability in digital circuit layout. The balanced constraint is an important constraint that obtains an area balanced layout without compromising the mincut objective. This paper ...
متن کاملAn Algorithm for Min Cut Partitioning for Digital Circuit Layout based on Evolutionary Approach
The paper presents a new algorithm for circuit partitioning that exploits some of the latest innovations of evolutionary approaches. The proposed algorithm based on swarm intelligence technique hybrids discrete version of artificial bee colony algorithm with Inver over operator along with simulated annealing technique for local improvement of solution. The algorithm is tested on small UCLA inst...
متن کاملA Study on the Relationship Mincut Circuit Partitioning
In this paper, we find the relationship between mincut circuit partitioning and the initial (V, E) pairs distributed condition I entropy on the V-E plain. If a circuit has higher initial potential / entropy, under a nearly max-cut reservation, we have higher probability to aim the mincut. The proposed new method is called Interleaved Cutting Edge-Node Interleaved Sort for Leaching and Envelop (...
متن کاملSoft Computing Approach for digital Circuit Layout based on Graph Partitioning
Soft computing based approaches are increasingly being used to solve different NP complete problems, the development of efficient parallel algorithms for digital circuit partitioning, circuit testing, logic minimization and simulation etc. is currently a field of increasing research activity. This paper describes evolutionary based approach for solving circuitpartitioning problem. That implies ...
متن کاملDigital Circuit Layout based on Graph Partitioning Technique using DNA Computing
After Adleman and Lipton have described the potential power of DNA computing, researchers have developed an interest in DNA computing for solving difficult computational problems like NP-complete problems. Partitioning of digital circuits also come under this category. Partitioning plays a key role in the design of a computer system. Existing conventional methods are unable to achieve the requi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/10152-5002